#include<iostream>
using namespace std;
const int N = 1e5 + 10;
int d[N], p[x];
int n, m;
int find(int x)
{
	if (x != p[x]) {
		int root = find(p[x]);
		d[x] += d[p[x]];
		p[x] = root;
	}
	return p[x];
}
int main()
{

	return 0;
}